The Block Conjugate Gradient for Multiple Right Hand Sides in a Direct Current Resistivity Inversion

نویسنده

  • Rowan Cockett
چکیده

In geophysical applications direct current (DC) resistivity surveys are collected by injecting current and recording voltage potentials over a field site of interest. These data sets can provide valuable non-invasive images of the sub-surface. The optimization problem that arrises in producing these images requires multiple solves of a linear system with numerous right hand sides (RHSs). Due to the three dimensional nature of the DC resistivity problem, the system to solve is typically too large for direct methods, and iterative methods must be used; in this case conjugate gradient (CG) is ideal. However, standard iterative solvers have no way to share information between the different solves. Information sharing techniques between the RHSs is necessary for speedy convergence and are why direct methods are so attractive. Standard iterative solvers can be modified to block methods that share information by solving multiple RHSs at once. The extension from CG to the corresponding block method, block conjugate gradient (BLCG), is clearly laid out and practical implementation issues are discussed. BLCG can have have numerical instabilities if linear dependencies exist between the different RHSs. This is dealt with through initial deflation and orthogonalization of the RHSs and an unequal convergence scheme. Numerical experiments were ran and suggest that using BLCG can have significant gains over using standard CG. These gains are most dramatic if initial deflation of the RHSs is possible and enforced.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs

In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...

متن کامل

Global conjugate gradient method for solving large general Sylvester matrix equation

In this paper, an iterative method is proposed for solving large general Sylvester matrix equation $AXB+CXD = E$, where $A in R^{ntimes n}$ , $C in R^{ntimes n}$ , $B in R^{stimes s}$ and  $D in R^{stimes s}$ are given matrices and $X in R^{stimes s}$  is the unknown matrix. We present a global conjugate gradient (GL-CG) algo- rithm for solving linear system of equations with multiple right-han...

متن کامل

Block Algorithms for Quark Propagator Calculation

Computing quark propagators in lattice QCD is equivalent to solving large, sparse linear systems with multiple right-hand sides. Block algorithms attempt to accelerate the convergence of iterative Krylov-subspace methods by solving the multiple systems simultaneously. This paper compares a block generalisation of the quasi-minimal residual method (QMR), Block Conjugate Gradient on the normal eq...

متن کامل

A highly scalable dense linear system solver for multiple right-hand sides in data analytics

We describe PP-BCG, a parallel iterative solver for the solution of dense and symmetric positive-definite linear systems with multiple right-hand sides suitable for MPPs. Such linear systems appear in the context of stochastic estimation of the diagonal of the matrix inverse in Uncertainty Quantification and the trace of matrix products in statistical analysis. We propose a novel numerical sche...

متن کامل

Block Bidiagonalization Methods for Solving Nonsymmetric Linear Systems with Multiple Right-hand Sides

Many applications require the solution of large nonsymmetric linear systems with multiple right-hand sides. Instead of applying an iterative method to each of these systems individually, it is often more eecient to use a block version of the method that generates iterates for all the systems simultaneously. In this paper, we propose block versions of Galerkin/minimal residual pair of bidiagonal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012